A Note on Domino Shuffling
نویسندگان
چکیده
We present a variation of James Propp’s generalized domino shuffling, which provides an efficient way to obtain perfect matchings of weighted Aztec diamonds. Our modification is specially tailored to deal with cases when some of the weights are zero. This allows us to tile efficiently a large class of planar graphs, by embedding them in a large enough Aztec diamond. We also give a sufficient condition on the size of the latter diamond for the algorithm to succeed.
منابع مشابه
Domino Shuffling on Novak Half-Hexagons and Aztec Half-Diamonds
We explore the connections between the well-studied Aztec Diamond graphs and a new family of graphs called the Half-Hexagons, discovered by Jonathan Novak. In particular, both families of graphs have very simple domino shuffling algorithms, which turn out to be intimately related. This connection allows us to prove an “arctic parabola” theorem for the Half-Hexagons as a corollary of the Arctic ...
متن کاملComputing a pyramid partition generating function with dimer shuffling
Abstract. We verify a recent conjecture of Kenyon/Szendrői by computing the generating function for pyramid partitions. Pyramid partitions are closely related to Aztec Diamonds; their generating function turns out to be the partition function for the Donaldson–Thomas theory of a non-commutative resolution of the conifold singularity {x1x2 −x3x4 = 0} ⊂ C. The proof does not require algebraic geo...
متن کاملLimits of Multilevel TASEP and similar processes
We study the asymptotic behavior of a class of stochastic dynamics on interlacing particle configurations (also known as Gelfand-Tsetlin patterns). Examples of such dynamics include, in particular, a multilayer extension of TASEP and particle dynamics related to the shuffling algorithm for domino tilings of the Aztec diamond. We prove that the process of reflected interlacing Brownian motions i...
متن کاملOn the Shuffling Algorithm for Domino Tilings∗
We study the dynamics of a certain discrete model of interacting interlaced particles that comes from the so called shuffling algorithm for sampling a random tiling of an Aztec diamond. It turns out that the transition probabilities have a particularly convenient determinantal form. An analogous formula in a continuous setting has recently been obtained by Jon Warren studying certain model of i...
متن کاملAchieving Integrated Care for Older People: Shuffling the Deckchairs or Making the System Watertight For the Future?
Integrated care has been recognised as a key initiative to resolve the issues surrounding care for older people living with multi-morbidity. Multiple strategies and policies have been implemented to increase coordination of care globally however, evidence of effectiveness remains mixed. The reasons for this are complex and multifactorial, yet many strategies deal with parts of the problem rathe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electr. J. Comb.
دوره 13 شماره
صفحات -
تاریخ انتشار 2006